A General Theorem Prover for Quantified Modal Logics
نویسندگان
چکیده
The main contribution of this work is twofold. It presents a modular tableau calculus, in the free-variable style, treating the main domain variants of quantified modal logic and dealing with languages where rigid and non-rigid designation can coexist. The calculus uses, to this end, light and simple semantical annotations. Such a general proof-system results from the fusion into a unified framework of two calculi previously defined by the second and third authors. Moreover, the work presents a theorem prover, called GQML-Prover, based on such a calculus, which is accessible in the Internet. The fair deterministic proof-search strategy used by the prover is described and illustrated via a meaningful example.
منابع مشابه
MSPASS: Modal Reasoning by Translation and First-Order Resolution
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for the relational cal-
متن کاملA Mechanisation of Classical Modal Tense Logics Using Isabelle
We present an implementation of an interactive theorem prover for the basic tense logic Kt, and many of its extensions, using the generic proof assistant Isabelle. The novelty of the implementation is that we use a Display Logic formalism of Kt as opposed to a traditional Gentzen system. The prover is intended to assist in meta-theoretical studies of tense logics rather than to be a fast theore...
متن کاملA modular, tactic-based approach to first-order temporal theorem proving
In system specification and formal verification it is a central issue to deal with temporal logics. In particular, First-Order Temporal Logics (FOTLs) are needed whenever the modeled systems are infinite-state. Reasoning in FOTLs is hard and few approaches have so far proved effective. In this paper we propose a novel approach to FOTLs, in the style of labelled deduction in Quantified Modal Log...
متن کاملAutomated Deduction for Deontic Logics: Laying the Foundations of Legal Expert Systems
ABSTRACT: Deontic logic can be used to formalise legal rules. The automation of reasoning in deontic logic can therefore be used as the basis of a legal expert system. In this paper we investigate the automation of deontic logic using tableau calculi for modal logics. The correspondance between the deontic and modal logics is outlined and the tableau for the modal logics used in the prover are ...
متن کاملAutomating Access Control Logics in Simple Type Theory with LEO-II
Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete way into modal logic S4. We have previously outlined how normal multimodal logics, including monomodal logics K and S4, can be embedded in simple type theory and we have demonstrated that the higher-order theorem prover LEO-II can automate reasoning in and about them. In this paper we c...
متن کامل